package priv.pront.code.lanqiao.competition.course.date0329;

import java.util.Scanner;

public class 找数 {
    static int N,left, right,target;
    static int[] arr;

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        N = scanner.nextInt();
        left = 0;
        right = N - 1;
        arr = new int[N];
        for (int i = 0; i < N; i++) {
            arr[i] = scanner.nextInt();
        }
        target = scanner.nextInt();

        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (arr[mid] < target) {
                left = mid + 1;
            } else if (arr[mid] > target) {
                right = mid - 1;
            }else{
                System.out.println(mid + 1);
                return;
            }
        }
        System.out.println("NO ANSWER");
    }
}
